Scheduling resource allocation with timeslot penalty for changeover
نویسندگان
چکیده
منابع مشابه
Scheduling resource allocation with timeslot penalty for changeover
Given a time slotted list of resource capacities, we address the problem of scheduling resource allocation considering that a change in allocation results in the changeover penalty of one timeslot. The goal is to maximize the overall allocation of resources. We prove that no 1lookahead algorithm can be better than 8/5-competitive. We provide improved analysis of Wait Dominate Hold (WDH) algorit...
متن کاملAdaptive resource allocation for efficient patient scheduling
OBJECTIVE Efficient scheduling of patient appointments on expensive resources is a complex and dynamic task. A resource is typically used by several patient groups. To service these groups, resource capacity is often allocated per group, explicitly or implicitly. Importantly, due to fluctuations in demand, for the most efficient use of resources this allocation must be flexible. METHODS We pr...
متن کاملResource Allocation Schemes for Gang Scheduling
Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. In this paper we first describe the ideas of job re-packing and workload tree for efficiently allocating resources to enhance the performance of gang scheduling. We then present some experimental results obtained by implementing four different resource allocation schemes. These ...
متن کاملTimeslot-based Resource Management in Grid Environments
The usage of static timeslots is a well-known approach to handling advance reservations in the scope of Grid resource management. In this paper we enhance the timeslot-based approach by introducing dynamic timeslots and the notion of granularity. The main contribution is the development of an analytical model of the interrelation between user and system parameters in order to describe their imp...
متن کاملDistributed timeslot allocation with crossed slots in CDMA-TDD systems
Code division multiple access system with time division duplex (CDMA-TDD) is a promising solution to cope with traffic asymmetry of downlink and uplink in multimedia services. When a rate of asymmetry is different in each cell, CDMA-TDD system may employ crossed slots, where a timeslot is used for different links in cells. However, it may suffer from base station (BS)-to-BS and mobile station (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.09.016